On the crossing number of Cartesian products with paths
نویسنده
چکیده
Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the conjecture of Jendrol’ and Ščerbová from 1982 about the crossing number of the Cartesian product K1,m2Pn. Our approach is applicable to the capped Cartesian products of Pn with any graph containing a dominating vertex.
منابع مشابه
On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملThe crossing numbers of certain Cartesian products
In this article we determine the crossing numbers of the Cartesian products of given three graphs on five vertices with paths.
متن کاملOn the crossing numbers of Cartesian products of paths with special graphs
There are known exact results of the crossing numbers of the Cartesian product of all graphs of order at most four with paths, cycles and stars. Moreover, for the path Pn of length n, the crossing numbers of Cartesian products G Pn for all connected graphs G on five vertices and for forty graphs G on six vertices are known. In this paper, we extend these results by determining the crossing numb...
متن کاملThe crossing numbers of products of path with graphs of order six
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G Pn for all connected graphs G on five vertices are also known. In this paper, the crossing numbers of Cartesian products G Pn for graphs G of order six are studied. Let H denote the unique tree of order si...
متن کاملOn the crossing numbers of Cartesian products of stars and graphs of order six
The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of crossing numbers were obtained. The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are ...
متن کامل